On expressing commutativity by finite Church-Rosser presentations : a note on commutative monoids

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids

— Let M be an infinité commutative monoid. Suppose that M has a Church-Rosser présentation. If M is cancellative or if the présentation is special then M is either the free cyclic group or the free cyclic monoid. Résumé. — Soit M un monoide commutatif infini. Supposons que M possède une présentation finie ayant la propriété de « Church-Rosser ». Si M est simplifiable ou si la présentation est s...

متن کامل

On Presentations of Commutative Monoids

In this paper, all the monoids considered are commutative. If S is a monoid generated by {m1, . . . ,mn}, then S is isomorphic to a quotient monoid of N by the kernel congruence σ of the map φ : N → S, φ(k1, . . . , kn) = ∑n i=1 kimi. Under this setting, a finite presentation for S is a finite subset ρ of Nn×Nn such that the congruence generated by ρ is equal to σ. Rédei proves in [5] that ever...

متن کامل

Church-Rosser Property and Homology of Monoids

We present a result of C. C. Squier relating two topics: • the canonical rewriting systems, which have been widely studied by computer scientists as a tool for solving word problems, • the homology of groups (more generally of monoids), which belongs to the core of pure mathematics, on the borders of algebra and topology. It is natural to ask whether finite canonical systems are the only way to...

متن کامل

Church-Rosser Made Easy

The Church–Rosser theorem states that the λ-calculus is confluent under αand β-reductions. The standard proof of this result is due to Tait and Martin-Löf. In this note, we present an alternative proof based on the notion of acceptable orderings. The technique is easily modified to give confluence of the βη-calculus.

متن کامل

Modular Church-Rosser Modulo

In [12], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modularity. The proof of this beautiful modularity result, technically based on slicing terms into an homogeneous cap and a so called alien, possibly heterogeneous substitution, was later substantially simplified in [5, 11]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO. Informatique théorique

سال: 1984

ISSN: 0399-0540

DOI: 10.1051/ita/1984180100471